Constraint-based Very Large-Scale Neighborhood search
نویسندگان
چکیده
منابع مشابه
Very Large-Scale Neighborhood Search
Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering. A critical issue in the design of a neighborhood search algorith...
متن کاملVery Large-Scale Neighborhood Search Techniques in Timetabling Problems
We describe the use of very large-scale neighborhood search (VLSN) techniques in examination timetabling problems. We detail three applications of VLSN algorithms that illustrate the versatility and potential of such algorithms in timetabling. The first of these uses cyclic exchange neighborhoods, in which an ordered subset of exams in disjoint time slots are swapped cyclically such that each e...
متن کاملVery Large-Scale Neighborhood Search for the Quadratic Assignment Problem
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to optimality only for fairly small size instances (typically, n ≤ 25). Neighborhood search algorithms are the most popular heuristic algorithms to...
متن کاملVery Large-Scale Neighborhood Search in Airline Fleet Scheduling
Many discrete optimization problems of practical interest cannot be solved to optimality in the available time. A practical approach to these problems is to use heuristic algorithms, which do not guarantee the optimality of the solution but which, for many problems, can find nearly optimal solutions within a reasonable amount of computational time. The literature on heuristic algorithms often d...
متن کاملA survey of very large-scale neighborhood search techniques
Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computation time. An improvement algorithm generally starts with a feasible solution and iteratively tries to obtain a better solution. Ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2011
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-011-9114-7